On sets of weak uniform distribution
نویسندگان
چکیده
منابع مشابه
Lyapunov Exponents and Uniform Weak Normally Repelling Invariant Sets
Let M be a compact invariant set contained in a boundary hyperplane of the positive orthant of R for a discrete or continuous time dynamical system defined on the positive orthant. Using elementary arguments, we show that M is uniformly weakly repelling in directions normal to the boundary in which M resides provided all normal Lyapunov exponents are positive. This result is useful in establish...
متن کاملUniform Functors on Sets
This paper is a contribution to the study of uniformity conditions for endofunctors on sets initiated in Aczel [1] and pursued later in other works such as Turi [17]. The main results have been that the “usual” functors on sets are uniform in our sense, and that assuming the Anti-Foundation Axiom AFA, a uniform functor H has the property that its greatest fixed point H∗ is a final coalgebra who...
متن کاملOn uniform weak König's lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2-conservative over primitive recursive arithmetic PRA (and even weaker fragments of ari...
متن کاملRecord Range of Uniform Distribution
We consider a sequence of independent and identicaly distributed (iid) random variables with absolutely continuous distribution function F(x) and probability density function (pdf) f(x). Let Rnl be the largest observation after observing nth record and R(ns) be the smallest observation after observing the nth record. Then we say Wnr = Rnl− R(ns), n > 1, as the nth record range. We will c...
متن کاملOn the Uniform Weak König’s Lemma
The so-called weak König’s lemma WKL asserts the existence of an infinite path b in any infinite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π2conservative over primitive recursive arithmetic PRA (and even weaker fragments of arit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1989
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-57-1-183-187